A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Rajendra Prasad, S.
- Pulping of Andhra Pradesh Hardwoods
Authors
Source
Indian Forester, Vol 96, No 9 (1970), Pagination: 691-696Abstract
Laboratory experiments on production of chemical pulps from individual six species of Andhra Pradesh hardwoods for wrapping papers by sulphate process are deacribed. Mixed pulping of these six species was also carried out. To confirm the laboratory reaults pilot plant trial was also undertaken. The investigation reported in this paper has shown that pulps in good yield and satisfactory strength properties could be prepared from these hardwood species.- Rate Allocation and Network Lifetime Problems for Wireless Sensor Networks
Authors
1 CSE dept. at Sri Indu College of Engineering & Technology, IN
2 JNTu, Hyderabad, IN
3 Sri Indu College of Engineering & Technology, JNTU Hyderabad, IN
Source
Wireless Communication, Vol 2, No 9 (2010), Pagination: 304-317Abstract
An important performance consideration for wireless sensor networks is the amount of information collected by all the nodes in the network over the course of network lifetime. Since the objective of maximizing the sum of rates of all the nodes in the network can lead to a severe bias in rate allocation among the nodes, we advocate the use of lexicographical max-min (LMM) rate allocation. To calculate the LMM rate allocation vector, we develop a polynomial-time algorithm by exploiting the parametric analysis (PA) technique from linear program (LP), which we call serial LP with Parametric Analysis (SLP-PA). We show that the SLP-PA can be also employed to address the LMM node lifetime problem much more efficiently than a state-of-the-art algorithm proposed in the literature. More important, we show that there exists an elegant duality relationship between the LMM rate allocation problem and the LMM node lifetime problem. Therefore, it is sufficient to solve only one of the two problems. Important insights can be obtained by inferring duality results for the other problem.